Dynamic Mesh Compression with Clustering

The use of 3D data in the form of triangle meshes is nowadays a widespread phenomenon. A great many examples of using this kind of data can be found in engineering applications or in film and gaming industry. These examples include not only static, but also dynamic meshes – 3D animations. This kind of data representation is usually voluminous and needs to be compressed for efficient storage and transmission. In this paper, we are dealing with the influence of vertex clustering on dynamic mesh compression. The mesh is divided into vertex clusters based on the vertex movement similarity and compressed per-partes to achieve higher compression performance. We use Coddyac as a basic compression algorithm and extend it by adding well known clustering algorithms to demonstrate the efficiency of this approach. We also deal with what clustering is the most appropriate Coddyac.